On Narrow Hexagonal Graphs with a 3-Homogeneous Suborbit
نویسندگان
چکیده
A connected graph of girth m ≥ 3 is called a polygonal graph if it contains a set of m-gons such that every path of length two is contained in a unique element of the set. In this paper we investigate polygonal graphs of girth 6 or more having automorphism groups which are transitive on the vertices and such that the vertex stabilizers are 3-homogeneous on adjacent vertices. We previously showed that the study of such graphs divides naturally into a number of substantial subcases. Here we analyze one of these cases and characterize the k-valent polygonal graphs of girth 6 which have automorphism groups transitive on vertices, which preserve the set of special hexagons, and which have a suborbit of size k − 1 at distance three from a given vertex.
منابع مشابه
The Extremal Graphs for (Sum-) Balaban Index of Spiro and Polyphenyl Hexagonal Chains
As highly discriminant distance-based topological indices, the Balaban index and the sum-Balaban index of a graph $G$ are defined as $J(G)=frac{m}{mu+1}sumlimits_{uvin E} frac{1}{sqrt{D_{G}(u)D_{G}(v)}}$ and $SJ(G)=frac{m}{mu+1}sumlimits_{uvin E} frac{1}{sqrt{D_{G}(u)+D_{G}(v)}}$, respectively, where $D_{G}(u)=sumlimits_{vin V}d(u,v)$ is the distance sum of vertex $u$ in $G$, $m$ is the n...
متن کاملSemisymmetry of Generalized Folkman Graphs
A regular edge but not vertex transitive graph is said to be semisym metric The study of semisymmetric graphs was initiated by Folkman who among others gave constructions of several in nite families such graphs In this paper a generalization of his construction for or ders a multiple of is proposed giving rise to some new families of semisymmetric graphs In particular one associated with the cy...
متن کاملNonsingular Green’s Functions for Multi-Layer Homogeneous Microstrip Lines
In this article, three new green's functions are presented for a narrow strip line (not a thin wire) inside or on a homogeneous dielectric, supposing quasi-TEM dominant mode. These functions have no singularity in contrast to so far presented ones, so that they can be used easily to determine the capacitance matrix of multi-layer and single-layer homogeneous coupled microstrip lines. To obtain ...
متن کاملUse of Structure Codes (Counts) for Computing Topological Indices of Carbon Nanotubes: Sadhana (Sd) Index of Phenylenes and its Hexagonal Squeezes
Structural codes vis-a-vis structural counts, like polynomials of a molecular graph, are important in computing graph-theoretical descriptors which are commonly known as topological indices. These indices are most important for characterizing carbon nanotubes (CNTs). In this paper we have computed Sadhana index (Sd) for phenylenes and their hexagonal squeezes using structural codes (counts). Sa...
متن کاملOn the distance eigenvalues of Cayley graphs
In this paper, we determine the distance matrix and its characteristic polynomial of a Cayley graph over a group G in terms of irreducible representations of G. We give exact formulas for n-prisms, hexagonal torus network and cubic Cayley graphs over abelian groups. We construct an innite family of distance integral Cayley graphs. Also we prove that a nite abelian group G admits a connected...
متن کامل